On recursive sets and regressive isols.
نویسندگان
چکیده
منابع مشابه
Recursive Fibers of Rst Isols
Motivated by a conjecture of Ellentuck concerning fibers f^x(C), f recursive and C an element of one of Barback's "tame models" (Tame models in the isols, Houston J. Math. 12 (1986), 163-175), we study such fibers in the more general context of Nerode semirings. The principal results are that (1) all existentially complete Nerode semirings meet all of their recursive fibers, and (2) not all Ner...
متن کاملCovering the Recursive Sets
We give solutions to two of the questions in a paper by Brendle, BrookeTaylor, Ng and Nies. Our examples derive from a 2014 construction by Khan and Miller as well as new direct constructions using martingales. At the same time, we introduce the concept of i.o. subuniformity and relate this concept to recursive measure theory. We prove that there are classes closed downwards under Turing reduci...
متن کاملRecursive Cellular Automata Invariant Sets
A bstract. Subshift s of bi-infinit e words give rise to languages in a natural way. Three invariant subshifts associated wit h cellular automata dynamics are considered : the periodic set, non-wandering set , and limit set . Exam ples have been given (see [8,12]) of cellular automata whose invarian t sets give rise to nonrecursive languages. In this pap er , examples are given of cellular aut ...
متن کاملHereditarily Odd–even and Combinatorial Isols
In this paper we study some of the arithmetic structure that is found in a special kind of semi-ring in the isols. These are the semi-rings [D(Y ),+, ·] that were introduced by J.C.E. Dekker, and that were later shown by E. Ellentuck to model the true universal recursive statements of arithmetic when Y is a regressive isol and is hyper-torre (= hereditarily odd-even = HOE). When Y is regressive...
متن کاملRegressive functions on pairs
We compute an explicit upper bound for the regressive Ramsey numbers by a combinatorial argument, the corresponding function being of Ackermannian growth. For this, we look at the more general problem of bounding g(n,m), the least l such that any regressive function f : [m, l] → N admits a min-homogeneous set of size n. Analysis of this function also leads to the simplest known proof that the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Michigan Mathematical Journal
سال: 1968
ISSN: 0026-2285
DOI: 10.1307/mmj/1028999902